Eigenvalue Asymptotics for a Non-Selfadjoint Elliptic Problem Involving an Indefinite Weight
نویسندگان
چکیده
منابع مشابه
Eigenvalue asymptotics for randomly perturbed non-selfadjoint operators
We consider quite general h-pseudodifferential operators on R with small random perturbations and show that in the limit h → 0 the eigenvalues are distributed according to a Weyl law with a probabality that tends to 1. The first author has previously obtained a similar result in dimension 1. Our class of perturbations is different. Résumé Nous considérons des opérateurs h-pseudodifférentiels as...
متن کاملPrincipal eigenvalue for an elliptic problem with indefinite weight on cylindrical domains.
This paper is concerned with an indefinite weight linear eigenvalue problem in cylindrical domains. We investigate the minimization of the positive principal eigenvalue under the constraint that the weight is bounded by a positive and a negative constant and the total weight is a fixed negative constant. Biologically, this minimization problem is motivated by the question of determining the opt...
متن کاملPrincipal Eigenvalue Minimization for an Elliptic Problem with Indefinite Weight and Robin Boundary Conditions
This paper focuses on the study of a linear eigenvalue problem with indefinite weight and Robin type boundary conditions. We investigate the minimization of the positive principal eigenvalue under the constraint that the absolute value of the weight is bounded and the total weight is a fixed negative constant. Biologically, this minimization problem is motivated by the question of determining t...
متن کاملAn Eigenvalue Problem for Elliptic Systems
By means of non-smooth critical point theory we prove existence of weak solutions for a general nonlinear elliptic eigenvalue problem under natural growth conditions .
متن کاملAn adaptive homotopy approach for non-selfadjoint eigenvalue problems
This paper presents adaptive algorithms for eigenvalue problems associated with non-selfadjoint partial differential operators. The basis for the developed algorithms is a homotopy method which departs from a wellunderstood selfadjoint problem. Apart from the adaptive grid refinement, the progress of the homotopy as well as the solution of the iterative method are adapted to balance the contrib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 1995
ISSN: 0035-7596
DOI: 10.1216/rmjm/1181072276